A Characterization of Maximal Outerplanar-Open Distance Pattern Uniform Graphs

Let A ⊆ V(H) of any graph H, every node w H be labeled using a set numbers; , where d(w,v) denotes the distance between and v in known as its open A-distance pattern. is distance-pattern uniform (odpu)-graph, if there nonempty subset ⊆V(H) together with same for all . Here pattern (odpu-) labeling an odpu-set H. The minimum cardinality vertices it exists, will odpu-number This article gives characterization maximal outerplanar-odpu graphs. Also, establishes that possible odpu-maximal outerplanar either two or five only.